Hamiltonicity and combinatorial polyhedra

Adjacency on Combinatorial Polyhedra

This paper shows some useful properties of the adjacency structures of a class of combinatorial polyhedra including the equality constrained 0-1 polytopes. The class of polyhedra considered here includes 0-1 polytopes related to some combinatorial optimization problems; e.g., set partitioning polytopes, set packing polytopes, perfect matching polytopes, vertex packing polytopes and all the face...

Integer Polyhedra: Combinatorial Properties and Complexity

Cardinality constrained combinatorial optimization: Complexity and polyhedra

Given a combinatorial optimization problem and a subset N of natural numbers, we obtain a cardinality constrained version of this problem by permitting only those feasible solutions whose cardinalities are elements of N . In this paper we briefly touch on questions that addresses common grounds and differences of the complexity of a combinatorial optimization problem and its cardinality constra...

Notes on Combinatorial Mathematics: Anti-blocking Polyhedra

Cs 598csc: Combinatorial Optimization 1 Polyhedra and Linear Programming

In this lecture, we will cover some basic material on the structure of polyhedra and linear programming. There is too abundant material on this topic to be covered in a few classes, so pointers will be given for further reading. For algorithmic and computational purposes one needs to work with rational polyhedra. Many basic results, however, are valid for both real and rational polyhedra. There...